A time-to-live based reservation algorithm on fully decentralized resource discovery in Grid computing

We present an alternative algorithm of fully decentralized resource discovery in Grid computing, which enables the sharing, selection, and aggregation of a wide variety of geographically distributed computational resources. Our algorithm is based on a simply unicast request transmission that can be easily implemented. The addition of a reservation algorithm can find more available matching resources in resource discovery mechanism. The deadline for resource discovery time is decided with time-to-live (TTL) value. With our algorithm, the only one resource is automatically decided for any request if multiple available resources are found on forward path of resource discovery, resulting in no need to ask user to manually select the resource from a large list of available matching resources. We evaluated the performance of our algorithms by comparing with first-found-firstserved (FFFS) algorithm. The experiment results show that we can select the algorithm which improves the performance of resource utilization or turn-around time. The algorithm that finds the available matching resource whose attributes are closest to the required attribute can improve the resource utilization, whereas another one that finds the available matching resource which has the highest performance can improve the turn-around time.